A Dynamic File Replication Based on Cpu Load and Consistency Mechanism in a Trusted Distributed Environment

Original scientific paper An effort has been made to propose a CPU load based dynamic, cooperative, trust based, and secure file replication approach based along with consistency among file replicas for distributed environment. Simulation results consisting of 100 requesting nodes, three file servers and file size ranging from 677 KB to 11 MB establishes that, when the CPU load is taken into consideration, the average decrease in file request completion time is about 22,04 ÷ 24,81 % thus optimizing the CPU load and minimizing the file request completion time. The CPU load decreases by 4,25 ÷ 5,58 %. Results show that, the average write latency with proposed mechanism decreases by 6,12 % as compared to Spinnaker writes and the average read latency is 3 times better than Cassandra Quorum Read (CQR). The proposed partial update propagation for maintaining file consistency stands to gain up to 69,67 % in terms of time required to update stale replicas. Thus the integrity of files and behaviour of the requesting nodes and file servers is guaranteed within even lesser time. Finally, a relationship between the formal aspects of simple security model and secure reliable CPU load based file replication model is established through process algebra.